#include <iostream>
#include <fstream>
#include <vector>
#include <chrono>
#include <map>
#include <ctime>
#include <ratio>
#include <conio.h>
#include <queue>
#include <stack>
#include <deque>
#include <iomanip>
#include <string>
#include <algorithm>
#include "hNode.h"

#pragma once

using namespace std;
template <class Key> class HashTable
{
private:
	Key nyckel;
	hNode *Tabell[];
	hash<Key> hashNow;
public:

	HashTable(void)
	{
	}

	HashTable(int Tablesize)
	{
		Tabell = new hNode[Tablesize];
	}

	~HashTable(void)
	{
	}

	long hashItNow(Key k)
	{
		long value = hashNow(k) %  ;
		return value;
	}

	void Add(Key k)
	{
		index = hasItNow(k);
		if
	}
};

